/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Array/Easy/Find%20the%20element%20that%20appears%20once.cpp
class Solution{
public:
int search(int A[], int N){
//code
int xor1 = 0;
for(int i=0 ;i<N; i++){
xor1 = xor1 ^ A[i];
}
return xor1;
}
};